Cooperative Task Assignment and Path Planning of Multiple UAVs Using Genetic Algorithm

نویسندگان

  • Yeonju Eun
  • Hyochoong Bang
چکیده

This paper addresses the task assignment and path planning problem of multiple UAVs. As one of the strategies for a SEAD(Suppressions of Enemy Air Defense) mission, an efficiency strategy for assignment and path planning of homogeneous UAVs is developed. There are many path planning methods (e.g. potential function method or probabilistic roadmap method) to avoid obstacles, but the Voronoi diagram is used for the path planning with avoiding the “No fly zones” in this study. Since several candidate-paths are needed to solve the problem of timing constraints, the flyable paths in the shape of net is generated by using Voronoi diagram and multiple paths are found as the candidate paths from each UAV to each target. The objective function is determined as accumulated sum of the required time to finish the tasks on each target and the optimization is achieved by using genetic algorithm with appropriate representation of chromosome and genetic operators.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Assignment of Cooperating UAVs to Simultaneous Tasks using Genetic Algorithms

A problem of assigning multiple unmanned aerial vehicles (UAVs) to simultaneously perform cooperative tasks on consecutive targets is posed as a new NP-hard combinatorial optimization problem. The investigated scenario consists of multiple ground moving targets prosecuted by a team of heterogeneous UAVs carrying designated sensors and/or weapons. To successfully prosecute each target it first n...

متن کامل

Decentralized Task Assignment for Multiple UAVs using Genetic Algorithm with Negotiation scheme approach

This paper deals with a task assignment problem of cooperative multiple Unmanned Aerial Vehicles (UAVs). The problem about assigning the tasks to each UAV can be interpreted as a combinatorial optimization problem such as Travelling Salesman Problem (TSP), Vehicle Routing Problem (VRP), and Generalized Assignment Problem (GAP). These problems have NP-complete computational complexity which has ...

متن کامل

Cooperative Task Assignment Using Dynamic Ranking

The paper presents a novel approach to the decentralized task assignment for multiple cooperative unmanned air systems, in a multiple target-multiple task environment. The vehicles (or agents) may have complete or partial a priori information about the targets that populate the scenario. Each vehicle autonomously computes the cost for servicing each task available at each target using a path pl...

متن کامل

Cooperative Aerial Coverage Path Planning for Visual Inspection of Complex Infrastructures

This article addresses the problem of Cooperative Coverage Path Planning (C-CPP) for the inspection of complex infrastructures (offline 3D reconstruction) by utilizing multiple Unmanned Autonomous Vehicles (UAVs). The proposed scheme, based on a priori 3D model of the infrastructure under inspection, is able to generate multiple paths for UAVs in order to achieve a complete cooperative coverage...

متن کامل

Robust Decentralized Task Assignment for Cooperative UAVs

This paper investigates the problem of decentralized task assignment for a fleet of cooperative UAVs. It extends the analysis of a previously proposed algorithm to consider the performance with different communication network topologies. The results show that the second communication step introduced during the planning phase of the new algorithm is crucial for sparse networks because the conver...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007